- 整數規劃問題
- integer: n. 1.【數學】整數 (opp. fraction)。 ...
- problem: n. 1.問題，課題；疑難問題；令人困惑的情況。 2.【 ...
- integer programming: 整數規劃法; 整體規劃
- programming problem: 程序設計問題
- all-integer programming: 全整數規劃
下載手機詞典可隨時隨地查詞查翻譯
integer programming problem中文什么意思
- 整數規劃問題
下載手機詞典可隨時隨地查詞查翻譯
例句與用法
- Many problems of engineering and system are integer or mixed integer programming problems . lt is well known that the problem of integer programming is a np - hard problem , and the method for it is exponential complex
工程、系統問題中有許多問題屬于整數或混合整數規劃問題。眾所周知，線性整數規劃問題是np - hard問題，求解該問題的精確解算法具有指數復雜性。 - However , signals take effect by the switch of signal phases , which introduces integer control values into the traffic control problem , so the traffic control problem becomes a large - scale mixed integer programming problem , the computation of which requires an exponential - complexity optimiz ation algorithm
但是，信號燈通過相位切換對交叉口進行控制，同時也在交通控制模型中引入了整數決策變量，使交通控制模型成為一個大規模混合整數規劃問題，需要指數復雜度的優化算法。 - The elip is suitable for the case that the uncontrollable subnet is cascade petri net and some cascade subnets are neither acyclic petri nets nor state graphs , and the main character is that the nonlinear integer program problem is converted into the problem that can be solved by using some standardized mathematical tools
當不可控子網是序狀petri網，且無法用整數規劃法綜合控制器時，可使用擴展線性整數規劃法，該方法的優點在于把非線性整數規劃轉化為可用標準數學工具求解的問題。 - Abstract : a new algorithm w - ecop is presented to effect incremental changes on a standard cell layout automatically . this algorithm deals with cell inserting and cell moving based on rows instead of on cells as most placement algorithms usually do . an integer programming problem is formulated to minimize the adjustment on the initial placement and a heuristic method is presented to search for a shifting path so as to optimize the wirelength . test of w - ecop on a group of practical test cases shows that the algorithm can successfully accomplish incremental placement with good quality and high speed
文摘:提出了一種新的增量式布局方法w - ecop來滿足快速調整布局方案的要求.與以前的以單元為中心的算法不同,算法基于單元行劃分來進行單元的插入和位置調整,在此過程中使對原布局方案的影響最小,并且盡可能優化線長.一組從美國工業界的測試例子表明,該算法運行速度快,調整后的布局效果好